FPART: A Multi-way FPGA Partitioning Procedure Based on the Improved FM Algorithm
نویسندگان
چکیده
| In this paper, a multi-way FPGA partitioning procedure FPART is introduced. The objective function of this procedure is to reduce the number of FPGA devices and the IOB utilization. An improved min-span FM bi-partitioning algorithm on the basis of an advanced gain model is adopted as the fundamental method, and three modules: init-part, optimize, and merge are combined in FPART to approach better results. After initial partitioning, the procedure optimizes the subsets to reduce the total span of cutset and then merges some subsets by removing the cells in them. Experimental results with MCNC'93 benchmarks show that FPART is fast and e cient.
منابع مشابه
Timing Driven Multi-FPGA Board Partitioning
System level design is increasingly turning towards FPGAs to take advantage of their low cost and fast prototyping. In this paper we present a timing driven partitioning approach for architecturally constrained reconngurable multi-FPGA systems. The partitioning approach using a Path-based clustering based on the attraction function proposed by Kahng et.al 19] followed by FM based min-cut partit...
متن کاملBehavioral Partitioning with Synthesis for Multi-FPGA Architectures under Interconnect, Area, and Latency Constraints
This paper presents a technique to perform partitioning and synthesis of behavioral specifications. Partitioning of the design is done under multiple constraints – interconnections and device areas of the reconfigurable architecture, and the latency of the design. The proposed Multi-FPGA partitioning technique (FMPAR) is based on the Fiduccia-Mattheyses (FM) partitioning algorithm. In order to ...
متن کاملDiscrete Multi Objective Particle Swarm Optimization Algorithm for FPGA Placement (RESEARCH NOTE)
Placement process is one of the vital stages in physical design. In this stage, modules and elements of circuit are placed in distinct locations according to optimization basis. So that, each placement process tries to influence on one or more optimization factor. In the other hand, it can be told unequivocally that FPGA is one of the most important and applicable devices in our electronic worl...
متن کاملField Programmable Gate Array–based Implementation of an Improved Algorithm for Objects Distance Measurement (TECHNICAL NOTE)
In this work, the design of a low-cost, field programmable gate array (FPGA)-based digital hardware platform that implements image processing algorithms for real-time distance measurement is presented. Using embedded development kit (EDK) tools from Xilinx, the system is developed on a spartan3 / xc3s400, one of the common and low cost field programmable gate arrays from the Xilinx Spartan fami...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کامل